package class08;

import class04.HeapSort;

/**
 * @author zhangchaoliang
 * create 2022
 */
public class PrintBinaryTree2 {

    public static class Node{
        public int value;
        public Node left;
        public Node right;

        public Node(int data){
            value = data;
        }
    }

    public static void printTree(Node head){
        System.out.println("Binary Tree:");
        printInOrder(head,0,"H",17);
        System.out.println();
    }

    public static void printInOrder(Node head,int height,String to,int len){
        if (head==null)
            return;
        printInOrder(head.right,height+1,"v",len);

        String val = to + head.value+to;
        int lenM = val.length();
        int lenL = (len-lenM)/2;
        int lenR = len-lenM-lenL;
        val = getSpace(lenL)+val+getSpace(lenR);
        System.out.println(getSpace(height*len)+val);

        printInOrder(head.left,height+1,"^",len);
    }

    public static String getSpace(int num){
        String space = " ";
        StringBuffer buf = new StringBuffer();
        for (int i=0;i<num;i++){
            buf.append(space);
        }
        return buf.toString();
    }

    public static void main(String[] args) {
        Node head = new Node(1);
        head.left = new Node(-222222222);
        head.right = new Node(3);
        head.left.left = new Node(Integer.MIN_VALUE);
        head.right.left = new Node(55555555);
        head.right.right = new Node(66);
        head.left.left.right = new Node(777);
        printTree(head);
    }
}
